Revenue maximization in the dynamic knapsack problem
نویسندگان
چکیده
منابع مشابه
Revenue maximization in the dynamic knapsack problem
We characterize the revenue maximizing policy in the dynamic and stochastic knapsack problem where a given capacity needs to be allocated by a given deadline to sequentially arriving agents. Each agent is described by a twodimensional type that reects his capacity requirement and his willingness to pay per unit of capacity. Types are private information. We rst characterize implementable poli...
متن کاملA two-dimensional problem of revenue maximization
We consider the problem of finding the mechanism that maximizes the revenue of a seller of multiple objects. This problem turns out to be significantlymore complex than the casewhere there is only a single object (which was solved by Myerson, 1981). The analysis is difficult even in the simplest case studied here, where there are two exclusive objects and a single buyer, with valuations uniform...
متن کاملDynamic revenue maximization: A continuous time approach
We characterize the profit-maximizing mechanism for repeatedly selling a non-durable good in continuous time. The valuation of each agent is private information and changes over time. At the time of contracting every agent privately observes his initial type which influences the evolution of his valuation process. In the profit-maximizing mechanism the allocation is distorted in favor of agents...
متن کاملApproximating the Revenue Maximization Problem with Sharp Demands
We consider the revenue maximization problem with sharp multi-demand, in which m indivisible items have to be sold to n potential buyers. Each buyer i is interested in getting exactly di items, and each item j gives a benefit vij to buyer i. We distinguish between unrelated and related valuations. In the former case, the benefit vij is completely arbitrary, while, in the latter, each item j has...
متن کاملUpper bounds for revenue maximization in a satellite scheduling problem
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem with Time Windows is defined and enriched with valid inequalities based on task interval reasoning. The non-concavity of the objective function to be maximized is also studied. Finally a Russian Dolls approach combine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Economics
سال: 2011
ISSN: 1933-6837
DOI: 10.3982/te700